#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 1e5 + 10;
int a[N];
int n;
int v[N],c[N],cnt = 0;

int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    cin >> n;
    for (int i = 1;i <= n;i ++)
        cin >> a[i];

    sort(a + 1,a + n + 1);
    for (int i = 1;i <= n;i ++)
    {
        int j = i + 1;
        while (a[j] == a[i] && j <= n) j ++;
        v[++ cnt] = a[i];
        c[cnt] = j - i;
        i = j - 1;
    }
    //for (int i = 1;i <= cnt;i ++) cout << v[i] << " "  << c[i] << endl;

    int ans = 0;
    for (int i = 1;i < cnt;i ++)
    {
        ans += c[i];
        ans = max(0,ans - c[i + 1]);
    }
    cout << ans + c[cnt] << endl;
    return 0;
}
